Scheduling jobs with release dates on parallel batch processing machines
نویسندگان
چکیده
منابع مشابه
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
In this paper we deal with the problem of assigning a set of n jobs, with release dates and tails, to either one of two unrelated parallel machines and scheduling each machine so that the makespan is minimized. This problem will be denoted by R2jri; qijCmax. The model generalizes the problem on one machine 1jri; qijCmax, for which a very ecient algorithm exists. In this paper we describe a Bra...
متن کاملBicriteria Scheduling of Equal Length Jobs with Release Dates on Identical Parallel Machines
We consider bicriteria scheduling problems on parallel, identical machines with job release dates. The jobs are assumed to have equal processing times. Our main goal in this paper is to report complexity results for bicriteria problems in this environment when the number of machines is assumed to be a fixed or constant value. The results are based on a straightforward use of the dynamic program...
متن کاملParallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection
We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted and processed on a single batching machine, or rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of t...
متن کاملFachbereich 3 Mathematik Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds *
We consider the problem of nonpreemptively scheduling a set of jobs with identical processing requirements (unit jobs) on parallel machines with nonstationary speeds. In addition to the case of uniform machines, this allows for such predictable eeects as operator learning and tool wear and tear, as well as such planned activities as machine upgrades, maintenance and the preassignment of other o...
متن کاملEfficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with nonidentical capacities where each job can only be processed on a specified subset of machines called its processing set. For the case of equal release times, we give efficient exact algorithms for various objective functions. For the case of unequal release times, we give efficient exact algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.12.012